Unordered Tuples in Quantum Computation
نویسندگان
چکیده
It is well known that the C∗-algebra of an ordered pair of qubits is M2⊗M2. What about unordered pairs? We show in detail that M3⊕C is the C∗-algebra of an unordered pair of qubits. Then we use Schur-Weyl duality to characterize the C∗-algebra of an unordered n-tuple of d-level quantum systems. Using some further elementary representation theory and number theory, we characterize the quantum cycles. We finish with a characterization of the von Neumann algebra for unordered words.
منابع مشابه
Twisted cohomology of configuration spaces of the plane and spaces of maximal tori via point-counting
We consider two families of algebraic varieties Yn indexed by natural numbers n: the configuration space of unordered n-tuples of distinct points on C, and the space of unordered n-tuples of linearly independent lines in C. Let Wn be any sequence of virtual Sn-representations given by a character polynomial, we compute H(Yn;Wn) for all i and all n in terms of double generating functions. One co...
متن کاملExact quantum lower bound for grover's problem
One of the most important quantum algorithms ever discovered is Grover’s algorithm for searching an unordered set. We give a new lower bound in the query model which proves that Grover’s algorithm is exactly optimal. Similar to existing methods for proving lower bounds, we bound the amount of information we can gain from a single oracle query, but we bound this information in terms of angles. T...
متن کاملAcceleration and execution of relational queries using general purpose graphics processing unit (GPGPU)
s away much detail about the actual execution of a program from application developers: developers only specify logical relationships between data. Compared to emerging distributed programming languages for GPUs such as Map-Reduce [24], LogiQL expresses a richer set of relational and database operations that are cumbersome to implement in Map-Reduce. 2.1.2 Relational Algebra Primitives Database...
متن کاملLogical Definability of Counting Functions
The relationship between counting functions and logical expressibility is explored. The most well studied class of counting functions is #P, which consists of the functions counting the accepting computation paths of a nondeterministic polynomial-time Turing machine. For a logic L, #L is the class of functions on nite structures counting the tuples (T ; c) satisfying a given formula (T ; c) in ...
متن کاملCommunal Partitions of Integers
There is a well-known formula due to Andrews that counts the number of incongruent triangles with integer sides and a fixed perimeter. In this note, we consider the analagous question counting the number of k-tuples of nonnegative integers none of which is more than 1/(k−1) of the sum of all the integers. We give an explicit function for the generating function which counts these k-tuples in th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015